A note on ‘Algorithms for connected set cover problem and fault-tolerant connected set cover problem’
نویسندگان
چکیده
منابع مشابه
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
A flaw in the greedy approximation algorithm proposed by Zhang et al. for minimum connected set cover problem is corrected, and a stronger result on the approximation ratio of the modified greedy algorithm is established. The results are now consistent with the existing results on connected dominating set problem which is a special case of the minimum connected set cover problem.
متن کاملAlgorithms for connected set cover problem and fault-tolerant connected set cover problem
Given a set V of elements, S a family of subsets of V , and G a connected graph on vertex set S,a connected set cover (CSC) is a subfamily R of S such that every element in V is covered by at least one set of R, and the subgraph G[R] of G induced by R is connected. If furthermore G[R] is k-connected and every element in V is covered by at least m sets inR, thenR is a (k,m)-CSC. In this paper, w...
متن کاملComplexity and approximation of the connected set-cover problem
In this paper, we study the computational complexity and approximation complexity of the connected set-cover problem. We derive necessary and sufficient conditions for the connected set-cover problem to have a polynomial-time algorithm. We also present a sufficient condition for the existence of a (1 + ln δ)-approximation. In addition, one such (1 + ln δ)-approximation algorithm for this proble...
متن کاملA note on the generalized min-sum set cover problem
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin [1]. Bansal, Gupta, and Krishnaswamy [2] give a 485approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtai...
متن کاملImproved Algorithms for the Connected Sensor Cover Problem
Wireless sensor networks have recently posed many new system-building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.07.008